package com.hch.algorithm.binarytree;

public class ThreeNode<T> {
    private T data;
    private ThreeNode left;
    private ThreeNode right;
    private ThreeNode next;

    public ThreeNode(T data) {
        this.data = data;
        this.left = null;
        this.right = null;
        this.next = null;
    }

    public T getData() {
        return data;
    }

    public void setData(T data) {
        this.data = data;
    }

    public ThreeNode getLeft() {
        return left;
    }

    public void setLeft(ThreeNode left) {
        this.left = left;
    }

    public ThreeNode getRight() {
        return right;
    }

    public void setRight(ThreeNode right) {
        this.right = right;
    }

    public ThreeNode getNext() {
        return next;
    }

    public void setNext(ThreeNode next) {
        this.next = next;
    }
}
